A Scheduling Algorithm for Aperiodic Groups of Tasks in Distributed Real-Time Systems and its Holistic Analysis
نویسندگان
چکیده
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to be included, together with a set of aperiodic servers to deal with the processor utilisation and the network bandwidth local to the system nodes, in a distributed aperiodic server, and ii) an extensive analysis of the behaviour of the proposed scheduling algorithm by applying an holistic approach. The sensitivity of the response time of the algorithm to the parameters involved is also studied.
منابع مشابه
Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System
A real-time system consists of both aperiodic and periodic tasks. Periodic tasks have regular arrival times and hard deadlines. Aperiodic tasks have irregular arrival times and either soft or hard deadlines. In this paper, we present a new algorithm, the Sporadic Server algorithm, that greatly improves response times for soft-deadline aperiodic tasks and can guarantee hard deadlines for both pe...
متن کاملJoint Scheduling of Distributed Complex Periodic and Hard Aperiodic Tasks in Statically Scheduled Systems
In this paper we present algorithms for the joint scheduling of periodic and aperiodic tasks in statically scheduled distributed real-time systems. Periodic tasks are precedence constrained, distributed, and communicating over the nodes of the systems. Both soft and hard aperiodic tasks are handled. After a static schedule has been created in a rst step, the algorithms determine the amount and ...
متن کاملOn the convergence of the holistic analysis for EDF distributed systems
Dynamic scheduling techniques, and EDF (Earliest Deadline First) in particular, have demonstrated their ability to increase the schedulability of real time systems compared to fixed-priority scheduling. In distributed systems, the scheduling policies of the processing nodes tend to be the same as in stand-alone systems and, although few EDF networks exist, it is foreseen that dynamic scheduling...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کامل